Combinatorial parametrised spectra

نویسندگان

چکیده

We obtain combinatorial model categories of parametrised spectra, together with systems base change Quillen adjunctions associated to maps parameter spaces. work simplicial objects and use Hovey's sequential symmetric stabilisation machines. By means a Grothendieck construction for categories, we produce controlling the totality stable homotopy theory. The global category spectra is equipped monoidal structure (the external smash product) inducing pairings in twisted cohomology groups. As an application our results prove tangent prolongation Simpson's theorem, characterising $\infty$-categories presentable as accessible localisations presheaves spectra. Applying these theory smooth $\infty$-stacks produces well-behaved (symmetric monoidal) These models provide concrete foundation studying differential cohomology, incorporating previous Bunke Nikolaus.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parametrised Gröbner-Shirshov Bases

We consider the problem of describing Gröbner-Shirshov bases for free associative algebras in finite terms. To this end we consider parametrised elements of an algebra and give methods for working with them which under favourable conditions lead to a basis given by finitely many patterns. On the negative side we show that in general there can be no algorithm. We relate our study to the problem ...

متن کامل

Kan’s Combinatorial Spectra and Their Sheaves Revisited

The stable homotopy category (also known as the stable category, or derived category of spectra) is a foundational setting for generalized homology and cohomology, and as such, is perhaps the most important concept of modern algebraic topology. Yet, the category does not have a canonical construction, unlike, say, the category of chain complexes, which plays an analogous role for ordinary (co)h...

متن کامل

Parametrised Phonological Event Parsing

This paper describes a phonological event parser for spoken language recognition which has been provided with a parametrisable development environment for examining the extent to which linguistically signi cant issues such as linguistic competence (structural constraints) and linguistic performance (robustness) can play a role in the spoken language recognition task. Ein phonologischer Ereignis...

متن کامل

Parametrised Processor Generation

Programming Research Group, Oxford University Computing Laboratory, 11 Keble Road, Oxford, England OX1 3QD Abstract This paper reports work on the automatic generation of microprocessors to suit particular applications. We use our own hardware compilation system to produce synchronous hardware implementations of parallel programs and have constructed platforms incorporating FPGA and transputer ...

متن کامل

Axiomatization of a Class of Parametrised Bisimilarities 1 Axiomatization of a Class of Parametrised Bisimilarities

The question of when two nondeterministic concurrent systems are behaviourally related has occupied a large part of the literature on process algebra and has yielded a variety of equivalences (and congruences) and preorders ( and precongruences) all based on the notion of bisimulations. Recently one of the authors has tried to unify a class of these bisimulation based relations by a parametrise...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algebraic & Geometric Topology

سال: 2021

ISSN: ['1472-2739', '1472-2747']

DOI: https://doi.org/10.2140/agt.2021.21.801